Noether’s problem and descent

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On descent for coalgebras and type transformations

We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...

متن کامل

Descent on Elliptic Curves and Hilbert’s Tenth Problem

Descent via an isogeny on an elliptic curve is used to construct two subrings of the field of rational numbers, which are complementary in a strong sense, and for which Hilbert’s Tenth Problem is undecidable. This method further develops that of Poonen, who used elliptic divisibility sequences to obtain undecidability results for some large subrings of the rational numbers. 1. Hilbert’s Tenth P...

متن کامل

Descent on Elliptic Curves and Hilbert ’ S Tenth Problem

Descent via an isogeny on an elliptic curve is used to construct two subrings of the field of rational numbers, which are complementary in a strong sense, and for which Hilbert's Tenth Problem is undecidable. This method further develops that of Poonen, who used elliptic divisibility sequences to obtain undecid-ability results for some large subrings of the rational numbers. In 1970, Matijasevi...

متن کامل

A Gradient Descent Solution to the Monge-Kantorovich Problem

We present a new, simple, and elegant algorithm for computing the optimal mapping for the Monge-Kantorovich problem with quadratic cost. The method arises from a reformulation of the dual problem into an unconstrained minimization of a convex, continuous functional, for which the derivative can be explicitly found. The Monge-Kantorovich problem has applications in many fields; examples from ima...

متن کامل

A general descent framework for the monotone variational inequality problem

We present a framework for descent algorithms that solve the monotone variational inequality problem V IP v which consists in nding a solution v 2 v which satisses s(v) T (u?v) 0, for all u 2 v. This uniied framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notices of the International Congress of Chinese Mathematicians

سال: 2018

ISSN: 2326-4810,2326-4845

DOI: 10.4310/iccm.2018.v6.n2.a4